On the Newton polygons of twisted L-functions of binomials

Let χ be an order c multiplicative character of a finite field and $f(x)=x^d+\lambda x^e$ a binomial with $(d,e)=1$. We study the twisted classical and T-adic Newton polygons of f. When $p>(d-e)(2d-1)$, we give a lower bound of Newton polygons and show that they coincide if p does not divide a certain integral constant depending on $p\mathrm{mod}cd$.We conjecture that this condition holds if p is large enough with respect to $c,d$ by combining all known results and the conjecture given by Zhang-Niu. As an example, we show that it holds for $e=d-1$.     

Local linear convergence analysis of Primal–Dual splitting methods

In this paper, we study the local linear convergence properties of a versatile class of Primal–Dual splitting methods for minimizing composite non-smooth convex optimization problems. Under the assumption that the non-smooth components of the problem are partly smooth relative to smooth manifolds, we present a unified local convergence analysis framework for these methods. More precisely, in our framework, we first show that (i) the sequences generated by Primal–Dual splitting methods identify a pair of primal and dual smooth manifolds in a finite number of iterations, and then (ii) enter a local linear convergence regime, which is characterized based on the structure of the underlying active smooth manifolds. We also show how our results for Primal–Dual splitting can be specialized to cover existing ones on Forward–Backward splitting and Douglas–Rachford splitting/ADMM (alternating direction methods of multipliers). Moreover, based on these obtained local convergence analysis result, several practical acceleration techniques are discussed. To exemplify the usefulness of the obtained result, we consider several concrete numerical experiments arising from fields including signal/image processing, inverse problems and machine learning. The demonstration not only verifies the local linear convergence behaviour of Primal–Dual splitting methods, but also the insights on how to accelerate them in practice.     

Anisotropy Effects and Observational Data on the Constraints of Evolution Dark Energy Models

We investigate cosmological dark energy models where the accelerated expansion of the universe is driven by a field with an anisotropic universe. The constraints on the parameters are obtained by maximum likelihood analysis using observational of 194 Type Ia supernovae(SNIa) and the most recent joint light-curve analysis(JLA) sample. In particular we reconstruct the dark energy equation of state parameter w(z) and the deceleration parameter q(z). We find that the best fit dynamical w(z) obtained from the 194 SNIa dataset does not cross the phantom divide line w(z) =-1 and remains above and close to w(z)≈-0.92 line for the whole redshift range 0 ≤ z ≤ 1.75 showing no evidence for phantom behavior. By applying the anisotropy effect on the ΛCDM model, the joint analysis indicates that ?_(σ0)= 0.0163 ± 0.03,with 194 SNIa, ?_(σ0)=-0.0032 ± 0.032 with 238 the SiFTO sample of JLA and ?_(σ0)= 0.011 ± 0.0117 with 1048 the SALT2 sample of Pantheon at 1σ′confidence interval. The analysis shows that by considering the anisotropy, it leads to more best fit parameters in all models with JLA SNe datasets. Furthermore, we use two statistical tests such as the usual χ_(min)~2/dof and p-test to compare two dark energy models with ΛCDM model. Finally we show that the presence of anisotropy is confirmed in mentioned models via SNIa dataset.     

偏缠绕模的Frobenius性质

主要给出了偏缠绕模的Frobenius性质，推广了缠绕模相应的性质。     

改进的PNC方法及其在非线性偏微分方程多解问题中的应用

2017年，李昭祥等提出了一种偏牛顿-校正法（Partial Newton-Correction Method，简记为PNC方法），并利用它成功地计算出了三类非线性偏微分方程的多重不稳定解.本文在PNC方法的基础上，提出并发展了一种改进的PNC方法.首先，利用Nehari流形$\mathcal{N}$与零平凡解的可分离性，建立并证明了$\mathcal{N}$的某特殊子流形$\mathcal{M}$上的全局分离定理及其推广（即局部分离定理）.全局分离定理只跟非线性偏微分算子或相应的非线性泛函本身有关，而与具体的计算方法无关.对一些典型的非线性偏微分方程多解问题（比如，Henon方程问题），该全局分离定理的分离条件，经验证是成立的.另一个方面，通过修改或补充原辅助变换的定义，去掉了原辅助变换的奇异性；接着建立并证明了某些非线性偏微分方程问题的新未知解与该非线性偏微分算子零核空间的密切关系；在证明中，去掉了在原奇异变换下所需的标准收敛（standard convergence）假设.最后，计算实例与数值结果验证了改进的PNC方法的可行性和有效性；同时表明子流形$\mathcal{M}$与已知解的可分离性是PNC方法和本文新方法能成功找到多解的关键.